Subgraphs and network motifs in geometric networks

Subgraphs and network motifs in geometric networks.

Many real-world networks describe systems in which interactions decay with the distance between nodes. Examples include systems constrained in real space such as transportation and communication networks, as well as systems constrained in abstract spaces such as multivariate biological or economic data sets and models of social networks. These networks often display network motifs: subgraphs th...

Discovering Geometric Frequent Subgraphs

As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of these domains. An alternate way of modeling the objects in these data sets, is to use a graph to model the database objects. Within that model, the problem of finding frequent patterns becomes that of discov...

Bibliography/Bibliography of Geometric Motifs in Islamic Art: Geometric Motifs in the Mirror of Written Sources from Past to Present, Parvin Babaei and Somayeh Zadamiri

Discovering Frequent Geometric Subgraphs

Data mining-based analysis methods are increasingly being applied to datasets derived from science and engineering domains that model various physical phenomena and objects. In many of these datasets, a key requirement for their effective analysis is the ability to capture the relational and geometric characteristics of the underlying entities and objects. Geometric graphs, by modeling the vari...

Discovering Network Motifs in Protein Interaction Networks

This chapter examines some of the available techniques for analyzing a protein interaction network (PIN) when depicted as an undirected graph. Within this graph, algorithms have been developed which identify “notable” smaller building blocks called network motifs. The authors examine these algorithms by dividing them into two broad categories based on two definitions of “notable”: (a) statistic...